Search Method? Optimal Search∗

نویسنده

  • Raluca M. Ursu
چکیده

Understanding the method that consumers use to sample through alternatives is paramount to correctly estimating their preference and search cost parameters. Identifying consumers’ search method has been the subject of two recent papers (De los Santos et al. 2012; Honka and Chintagunta, 2014). Both of these papers find that the simultaneous search model more accurately describes consumers’ search patterns. Advantages, such as avoiding unnecessary costs of over investment in information, make sequential search dominate simultaneous search. Nevertheless, the sequential search method may be suboptimal when the consumer is time constrained. These tradeoffs suggest that a better search method exists that dominates both simultaneous and sequential search. Morgan and Manning (1985) present exactly such a model of optimal search. Under the optimal search rule, consumers choose both the number of firms to search at each stage and when to stop searching. Simultaneous search is a special case of this model when the consumer chooses how many firms to sample in only one stage, after which she stops searching. Sequential search is also a special case when the consumer only chooses when to stop searching, sampling one alternative at each stage. With data on several stages/phases in which the consumer searches, it is possible to test whether consumers are using the optimal search rule. In fact, empirical evidence exists that consumers search in phases: Blake, Nosko and Tadelis (2015) look at consumers searching on eBay and find that consumers do not do all their search in one phase, but narrow down their search as they approach a purchase, consistent with the optimal search rule of Morgan and Manning (1985). In this paper, I use data on consumer online browsing to test whether consumers search according to the model proposed by Morgan and Manning (1985). From preliminary analysis using comScore data on consumers searching for products in the apparel category, I find evidence of consumers searching in phases. In Figure 1, I plot the date and frequency with which consumers make a search within this category. What is immediately evident is that consumers visit a website in this category several times on the same day or on subsequent days. This period is then followed by a gap in their search activity, with larger gaps prevalent after a transaction. Search may then ∗I wish to thank Ali Hortaçsu, Pradeep Chintagunta, and Anita Rao. I wish to thank comScore for providing me with the data. The usual disclaimer applies. †University of Chicago, E-mail: [email protected].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Placement and Sizing of TCSC & SVC for Improvement Power System Operation using Crow Search Algorithm

Abstract: The need for more efficient power systems has prompted the use of a new technologies includes Flexible AC transmission system (FACTS) devices. FACTS devices provides new opportunity for controlling the line power flow and minimizing losses while maintaining the bus voltages within a permissible limit. In this thesis a new method is proposed for optimal placement and sizing of Thyristo...

متن کامل

OPTIMAL DESIGN OF STEEL MOMENT FRAME STRUCTURES USING THE GA-BASED REDUCED SEARCH SPACE (GA-RSS) TECHNIQUE

This paper proposes a GA-based reduced search space technique (GA-RSS) for the optimal design of steel moment frames. It tries to reduce the computation time by focusing the search around the boundaries of the constraints, using a ranking-based constraint handling to enhance the efficiency of the algorithm. This attempt to reduce the search space is due to the fact that in most optimization pro...

متن کامل

Constrained Nonlinear Optimal Control via a Hybrid BA-SD

The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...

متن کامل

Optimal Scheduled Unit Commitment Considering Wind Uncertainty Using Cuckoo Search Algorithm

In this paper, a new method to review the role of wind units as an energy-producer in the scheduling problem of unit commitment is presented. Today, renewable energy sources due to lack of environmental pollution, absence of dependence on fossil fuels, and consequently a very low marginal cost, have been receiving considerable attention in power system. But these sources are associated with unc...

متن کامل

OPTIMAL DESIGN OF ARCH DAMS FOR FREQUENCY LIMITATIONS USING CHARGED SYSTEM SEARCH AND PARTICLE SWARM OPTIMIZATION

In recent years, the importance of economical considerations in the field of dam engineering has motivated many researchers to propose new methods for minimizing the cost of dames and in particular arch dams. This paper presents a method for shape optimization of double curvature arch dams corresponding to minimum construction cost while satisfying different constraints such as natural frequenc...

متن کامل

Developing Self-adaptive Melody Search Algorithm for Optimal Operation of Multi-reservoir Systems

Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015